Generation of multi-polarity helix transform over GF(3)
نویسندگان
چکیده
In this article, the new multi-polarity helix transform for ternary logic functions has been introduced. In addition, an extended dual polarity property that had been used to optimize Kronecker and quaternary Fixed-Polarity Reed-Muller (FPRM) expressions has been applied to generate efficiently the multi-polarity helix transform over GF(3). The experimental results for the transform are compared with the well known ternary Reed-Muller transform and it was found that the helix transform is quite efficient in terms of non-zero spectral coefficients and corresponding memory storage.
منابع مشابه
Fast computing of the positive polarity Reed - Muller transform over GF ( 2 ) and GF ( 3 )
The problem of efficient computing of binary and ternary positive (or zero) polarity Reed-Muller (PPRM) transform is important for many areas. The matrices, determining these transforms, are defined recursively or by Kronecker product. Using this fact, we apply the dynamic-programming strategy to develop three algorithms. The first of them is a new version of a previous our algorithm for perfor...
متن کاملNew Ternary Fixed Polarity Linear Kronecker Transforms and Their Comparison with Ternary Reed-muller Transform
Two new fixed polarity linear Kronecker transforms executed over GF(3) are introduced in this article. Both transforms are based on recursive equations using Kronecker products what allows to obtain simple corresponding fast transforms and very regular butterfly diagrams. The computational costs to calculate the new pair of transforms and their experimental comparison with ternary Reed-Muller t...
متن کاملTernary Fixed Polarity Linear Kronecker Transforms and their Comparison with Ternary Reed-muller Transform
Two new fixed polarity linear Kronecker transforms executed over GF(3) are introduced in this article. Both transforms are based on recursive equations using Kronecker products what allows to obtain simple corresponding fast transforms and very regular butterfly diagrams. The computational costs to calculate the new pair of transforms and their experimental comparison with ternary Reed–Muller t...
متن کاملGeneralization of Boolean Functions Properties to Functions Defined over GF(p)
Abstract: Problem statement: Traditionally, cryptographic applications designed on hardware have always tried to take advantage of the simplicity of implementation functions over GF(p), p = 2, to reduce costs and improve performance. On the contrast, functions defined over GF(p); p > 2, possess far better cryptographic properties than GF(2) functions. Approach: We generalize some of the previou...
متن کاملCalculation of best fixed polarity Reed-Muller transform over GF(5)
In this article, a new algorithm that takes the truth vector of a 5-valued function as its input and proceeds to generate all of the function’s fixed polarity Reed-Muller (FPRM) spectral coefficient vectors one by one in a certain sequence is presented. The experimental results for this algorithm are compared with other methods and it was found that it is more efficient than other methods for s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEICE Electronic Express
دوره 1 شماره
صفحات -
تاریخ انتشار 2004